Deliberation scheduling using GSMDPs in stochastic asynchronous domains
نویسندگان
چکیده
منابع مشابه
Stochastic Deliberation Scheduling using GSMDPs
We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDPs). In particular, we use GSMDPs to more accurately model domains in which planning and execution occur concurrently, planimprovement actions have uncertain effects and duration, and events (such as threats) occur asyn...
متن کاملDeliberation Scheduling for Time-Critical Scheduling in Stochastic Domains
In this work we explore the use of deliberation scheduling for allocating computation among competing decision procedures in solving time-critical scheduling problems in stochastic domains. We present a two-level deliberation scheduling solution. At the higher level deliberation scheduling is used to partition innnite horizon scheduling problems temporally and sequence and allot computation tim...
متن کاملStochastic Model for the Asynchronous Scheduling Problem
A two-stage stochastic programming model is formulated for a distributed scheduling problem with scenario tree structure. The model allows independent and self-interested job agents to request resources in an asynchronous fashion. Rather than an exact starting time, the central agent gives a time window for one coming job immediately. The final schedule is made based on the total weighted tardi...
متن کاملTime-Critical Scheduling in Stochastic Domains
In this work we look at extending the work of (Dean et al. 1993) to handle more complicated scheduling problems in which the sources of complexity stem not only from large state spaces but from large action spaces as well. In these problems it is no longer tractable to compute optimal policies for restricted state spaces via policy iteration. We, instead, borrow from operations research in appl...
متن کاملTime-critical Planning and Scheduling in Stochastic Domains (extended Abstract)
In this note we summarize our recent work on time-critical decision-making under uncertainty. Our research has resulted in a family of algorithms that extend techniques in artiicial intelligence and operations research to eeciently handle stochastic processes with very large state and/or action spaces. In the traditional AI planning perspective the world is assumed to be deterministic and plann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2009
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2009.04.007